منابع مشابه
Palindromic complexity of infinite words associated with simple Parry numbers
A simple Parry number is a real number β > 1 such that the Rényi expansion of 1 is finite, of the form dβ(1) = t1 · · · tm. We study the palindromic structure of infinite aperiodic words uβ that are the fixed point of a substitution associated with a simple Parry number β. It is shown that the word uβ contains infinitely many palindromes if and only if t1 = t2 = · · · = tm−1 ≥ tm. Numbers β sat...
متن کاملOn Highly Palindromic Words
We study some properties of palindromic (scattered) subwords of binary words. In view of the classical problem on subwords, we show that the set of palindromic subwords of a word characterizes the word up to reversal. Since each word trivially contains a palindromic subword of length at least half of its length—a power of the prevalent letter—we call a word that does not contain any palindromic...
متن کاملPalindromic prefixes and episturmian words
Let w be an infinite word on an alphabet A. We denote by (ni)i≥1 the increasing sequence (assumed to be infinite) of all lengths of palindromic prefixes of w. In this text, we give an explicit construction of all words w such that ni+1 ≤ 2ni + 1 for all i, and study these words. Special examples include characteristic Sturmian words, and more generally standard episturmian words. As an applicat...
متن کاملPalindromic rich words and run-length encodings
We prove a number of results on the structure and enumeration of palindromes and antipalindromes. In particular, we study conjugates of palindromes, palindromic pairs, rich words, and the counterparts of these notions for antipalindromes.
متن کاملPalindromic complexity of infinite words associated with non-simple Parry numbers
We study the palindromic complexity of infinite words uβ , the fixed points of the substitution over a binary alphabet, φ(0) = 01, φ(1) = 01, with a − 1 ≥ b ≥ 1, which are canonically associated with quadratic non-simple Parry numbers β. 1991 Mathematics Subject Classification. 68R15, 11A63 .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2015
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196715500046